Theory Exploration Versus Theorem Proving abstract of invited talk
نویسندگان
چکیده
منابع مشابه
Theory Exploration and Inductive Theorem Proving
We have built two state-of-the-art inductive theorem provers named HipSpec and Hipster. The main issue when automating proofs by induction is to discover essential helper lemmas. Our theorem provers use the technique theory exploration, which is amethod to systematically discover interesting conclusions about a mathematical theory. We use the existing theory exploration system QuickSpec which c...
متن کاملTheory Exploration for Interactive Theorem Proving
Theory exploration is an automated reasoning technique for discovering and proving interesting properties about some set of given functions, constants and datatypes. In this note we describe ongoing work on integrating the HipSpec theory exploration system with the interactive prover Isabelle. We believe that such an integration would be beneficial for several reasons. In an interactive proof a...
متن کاملAbstract Theorem Proving
Informally, a b s t r a c t i o n can be described as the process of mapping a representation of a problem into a new representation. The aim of the paper is to propose a theory of abstrac t ion. The generality of the framework is tested by formalizing and analyzing some work done in the past; i ts efficacy by giving a procedure which solves the '' false proof problem by avoid ing the use of ...
متن کاملTransfers of Meaning (Invited Talk Abstract)
In one form or another, the phenomena associated with "meaning transfer" have become central issues in a lot of recent work on semantics. Speaking very roughly, we can partition approaches to the phenomenon along two dimensions, which yield four basic points of departure. In the first two, people have considered transfer in basically semantic or linguistic terms. Some have concentrated on what ...
متن کاملRegression Verification: Proving the Equivalence of Similar Programs (Invited Talk)
The ability to prove equivalence of successive, closely-related versions of a program can be useful for maintaining backward compatibility. This problem has the potential of being easier in practice than functional verification for at least two reasons: First, it circumvents the problem of specifying what the program should do; Second, in many cases it is computationally easier, because it offe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1999
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80610-3